Decodability Attack against the Fuzzy Commitment Scheme with Public Feature Transforms
نویسنده
چکیده
The fuzzy commitment scheme is a cryptographic primitive that can be used to protect biometric templates. If multiple records extracted from the same biometric characteristic have been intercepted, their correspondence can be examined, i.e., cross-matching, via the decodability attack. As a countermeasure, Kelkboom et al. proposed to apply a public but record-specific permutation to the feature string given as input to the fuzzy commitment scheme. In this paper, it is shown that this countermeasure does not prevent an adversary from cross-matching completely: He still may be able to examine records protecting slightly different templates and now even may recover them explicitly. The feasibility of the attack is demonstrated experimentally in this paper. Furthermore, it is proven that the attack cannot be prevented using another transformation process in a binary fuzzy commitment scheme. Fortunately, such a transformation can be designed for the non-binary case and it is briefly discussed how the improved fuzzy vault scheme by Dodis et al. can be used for protecting binary feature vectors while preventing record multiplicity attacks.
منابع مشابه
Optimal sequential fusion for multibiometric cryptosystems
Biometric cryptosystems have been widely studied in the literature to protect biometric templates. To ensure sufficient security of the biometric cryptosystem against the offline brute-force attack (also called the FAR attack), it is critical to reduce FAR of the system. One of the most effective approaches to improve the accuracy is multibiometric fusion, which can be divided into three catego...
متن کاملA collusion attack on the fuzzy vault scheme
The Fuzzy Vault scheme is an encryption scheme, which can tolerate errors in the keys. This leads to the possibility of enhancing the security in environments where these errors can be common, such as biometrics storage systems. Although several researchers have provided implementations, we find that the scheme is vulnerable to attacks when not properly used. This paper describes an attack on t...
متن کاملAn efficient certificateless signcryption scheme in the standard model
Certificateless public key cryptography (CL-PKC) is a useful method in order to solve the problems of traditional public key infrastructure (i.e., large amount of computation, storage and communication costs for managing certificates) and ID-based public key cryptography (i.e., key escrow problem), simultaneously. A signcryption scheme is an important primitive in cryptographic protocols which ...
متن کاملPossibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
The existence of encryption and commitment schemes secure under selective opening attack (SOA) has remained open despite considerable interest and attention. We provide the rst public key encryption schemes secure against sender corruptions in this setting. The underlying tool is lossy encryption. We then show that no non-interactive or perfectly binding commitment schemes can be proven secure ...
متن کاملThe Power of Identification Schemes
In this paper, we show that identification schemes (ID-schemes) are very powerful in some areas of cryptography. We first prove an equivalence between non-interactive trapdoor commitment schemes and a natural class of identification schemes. We next propose a more efficient on-line/off-line signature transformation than Shamir-Tauman. As an application, we present a variant of Boneh-Boyen (BB) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1406.1154 شماره
صفحات -
تاریخ انتشار 2014